Automatic Design of Deterministic and Non-Halting Membrane Systems by Tuning Syntactical Ingredients
نویسندگان
چکیده
منابع مشابه
Automatic Landing Guidance Systems and Design of an Optimal Landing Control System
Guidance and control of aircraft in the landing phase imposes extra pilot work loads, hence application of automatic landing control systems is of great importance. In this study automatic landing control systems are introduced and an optimal landing control system is designed. The control system performance criteria are based on minimum control effort. The designed system is simulated for a tr...
متن کاملAutomatic Landing Guidance Systems and Design of an Optimal Landing Control System
Guidance and control of aircraft in the landing phase imposes extra pilot work loads, hence application of automatic landing control systems is of great importance. In this study automatic landing control systems are introduced and an optimal landing control system is designed. The control system performance criteria are based on minimum control effort. The designed system is simulated for a tr...
متن کاملAutomatic Equivalence Proofs for Non-deterministic Coalgebras
A notion of generalized regular expressions for a large class of systems modeled as coalgebras, and an analogue of Kleene’s theorem and Kleene algebra, were recently proposed by a subset of the authors of this paper. Examples of the systems covered include infinite streams, deterministic automata, Mealy machines and labelled transition systems. In this paper, we present a novel algorithm to dec...
متن کاملTowards Automatic Non-Deterministic Web Service Composition
This paper describes our ongoing work towards the implementation of an online Web Service Composition system, based on the most prevalent Web Service standards and utilizing other open source projects as sub-elements. The system will treat non-determinism as an inherent characteristic of the problem and will tackle it by exploiting AI planning technology, specifically contingency planning. The ...
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on NanoBioscience
سال: 2014
ISSN: 1536-1241,1558-2639
DOI: 10.1109/tnb.2014.2341618